Counting the Number of Points on Elliptic Curves over Nite Elds of Characteristic Greater than Three
نویسندگان
چکیده
We present a variant of an algorithm of Oliver Atkin for counting the number of points on an elliptic curve over a nite eld. We describe an implementation of this algorithm for prime elds. We report on the use of this implementation to count the the number points on a curve over F p , where p is a 210-digit prime.
منابع مشابه
Counting the number of points on elliptic curves over finite fields of characteristic greater than three
We present a variant of an algorithm of Oliver Atkin for counting the number of points on an elliptic curve over a nite eld. We describe an implementation of this algorithm for prime elds. We report on the use of this implementation to count the number of points on a curve over IFp, where p is a 375-digit prime.
متن کاملFinding Good Random Elliptic Curves for Cryptosystems Deened over If 2 N
One of the main diiculties for implementing cryptographic schemes based on elliptic curves deened over nite elds is the necessary computation of the cardinality of these curves. In the case of nite elds IF2n, recent theoretical breakthroughs yield a signiicant speed up of the computations. Once described some of these ideas in the rst part of this paper, we show that our current implementation ...
متن کاملThe Probability That the Number of Points on an Elliptic Curve over a Finite Field Is Prime
The paper gives a formula for the probability that a randomly chosen elliptic curve over a nite eld has a prime number of points. Two heuristic arguments in support of the formula are given as well as experimental evidence. The paper also gives a formula for the probability that a randomly chosen elliptic curve over a nite eld has kq points where k is a small number and where q is a prime. 1. I...
متن کاملOn the Elliptic Curves of the Form $y^2 = x^3 − pqx$
By the Mordell- Weil theorem, the group of rational points on an elliptic curve over a number field is a finitely generated abelian group. This paper studies the rank of the family Epq:y2=x3-pqx of elliptic curves, where p and q are distinct primes. We give infinite families of elliptic curves of the form y2=x3-pqx with rank two, three and four, assuming a conjecture of Schinzel ...
متن کاملGenerating Elliptic Curves over Finite Fields Part I: Generating by Complex Multiplication
We study the theory of rational points on elliptic curves over nite elds and the theory of complex multiplication through which we construct elliptic curves over F p such that their orders of the group of rational points over F p are of the form mr where r is a prime and m is a small integer.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994